Strengthened Brooks Theorem for digraphs of girth three
نویسندگان
چکیده
Brooks’ Theorem states that a connected graph G of maximum degree ∆ has chromatic number at most ∆, unless G is an odd cycle or a complete graph. A result of Johansson [6] shows that if G is triangle-free, then the chromatic number drops to O(∆/ log ∆). In this paper, we derive a weak analog for the chromatic number of digraphs. We show that every (loopless) digraph D without directed cycles of length two has chromatic number χ(D) ≤ (1− e−13)∆̃, where ∆̃ is the maximum geometric mean of the out-degree and in-degree of a vertex in D, when ∆̃ is sufficiently large. As a corollary it is proved that there exists an absolute constant α < 1 such that χ(D) ≤ α(∆̃+1) for every ∆̃ > 2.
منابع مشابه
Strengthened Brooks' Theorem for Digraphs of Girth at least Three
Brooks’ Theorem states that a connected graph G of maximum degree ∆ has chromatic number at most ∆, unless G is an odd cycle or a complete graph. A result of Johansson shows that if G is triangle-free, then the chromatic number drops to O(∆/ log∆). In this paper, we derive a weak analog for the chromatic number of digraphs. We show that every (loopless) digraph D without directed cycles of leng...
متن کاملBrooks-type Results for Coloring of Digraphs
In the thesis, the coloring of digraphs is studied. The chromatic number of a digraph D is the smallest integer k so that the vertices of D can be partitioned into at most k sets each of which induces an acyclic subdigraph. A set of four topics on the chromatic number is presented. First, the dependence of the chromatic number of digraphs on the maximum degree is explored. An analog of Gallai’s...
متن کاملA short construction of highly chromatic digraphs without short cycles
A natural digraph analogue of the graph-theoretic concept of an ‘independent set’ is that of an ‘acyclic set’, namely a set of vertices not spanning a directed cycle. Hence a digraph analogue of a graph coloring is a decomposition of the vertex set into acyclic sets. In the spirit of a famous theorem of P. Erdős [Graph theory and probability, Canad. J. Math. 11 (1959), 34–38], it was shown prob...
متن کاملEigenvalues and Colorings of Digraphs
Wilf’s eigenvalue upper bound on the chromatic number is extended to the setting of digraphs. The proof uses a generalization of Brooks’ Theorem to digraph colorings.
متن کاملSmall H-Coloring Problems for Bounded Degree Digraphs
An NP-complete coloring or homomorphism problem may become polynomial time solvable when restricted to graphs with degrees bounded by a small number, but remain NP-complete if the bound is higher. For instance, 3-colorability of graphs with degrees bounded by 3 can be decided by Brooks’ theorem, while for graphs with degrees bounded by 4, the 3-colorability problem is NP-complete. We investigat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010